منابع مشابه
Discrete-Time Process Algebra with Empty Process
We introduce an ACP-style discrete-time process algebra with relative timing, that features the empty process. Extensions to this algebra are described, and ample attention is paid to the considerations and problems that arise when introducing the empty process. We prove time determinacy, soundness, completeness, and the axioms of standard concurrency. 1991 Mathematics Subject Classification: 6...
متن کاملDiscrete time process algebra with silent step
Abstract The axiom system ACP of [10] was extended to discrete time in [6]. Here, we proceed to define the silent step in this theory in branching bisimulation semantics [7, 15] rather than weak bisimulation semantics [11, 20]. The version using relative timing is discussed extensively, versions using absolute and parametric timing are presented in brief. A term model and a graph model are pres...
متن کاملDiscrete Time Process Algebra with Abstraction
ion in absolute timing. where all timing refers to an absolute clock. Here again. we only consider the two-phase version. In section 4. we have discrete time process algebra with parametric timing. where absolute and relative timing are integrated. For parametric timing. we introduce a model based on time spectrum sequences. An underlying viewpoint of the present paper is that for a given time ...
متن کاملDiscrete Time Process Algebra with Relative Timing
Process algebra in the form of ACP describes the main features of imperative concurrent programming without explicit mention of time. Implicitly, time is present in the interpretation of sequential composition: in p · q the process p must be executed before q. A quantative view on the relation between process execution and progress of time is absent in ACP, however. Process algebras can be deve...
متن کاملCompleteness in Discrete-Time Process Algebra
We prove soundness and completeness for some ACP-style concrete, relative-time, discrete-time process algebras. We treat non-delayable actions, delayable actions, and immediate deadlock. Basic process algebras are examined extensively, and also some concurrent process algebras are considered. We conclude with ACPdrt, which combines all described features in one theory. 1991 Mathematics Subject ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Formal Aspects of Computing
سال: 1996
ISSN: 0934-5043,1433-299X
DOI: 10.1007/bf01214556